Rees semigroups of digraphs for classification of data

Title: Rees semigroups of digraphs for classification of data
Creator: Abawajy, J.; Kelarev, A. V.; Miller, M.; Ryan, J.
Relation: ARC.DP0880501, DP0449469 & DP0450294 http://purl.org/au-research/grants/arc/DP0450294
Relation: Semigroup Forum Vol. 92, Issue 1, p. 121-134
Publisher Link: http://dx.doi.org/10.1007/s00233-014-9685-x
Publisher: Springer
Resource Type: journal article
Date: 2016
Description: Recent research has motivated the investigation of the weights of ideals in semiring constructions based on semigroups. The present paper introduces Rees semigroups of directed graphs. This new construction is a common generalization of Rees matrix semigroups and incidence semigroups of digraphs. For each finite subsemigroup S of the Rees semigroup of a digraph and for every zero-divisor-free idempotent semiring F with identity element, our main theorem describes all ideals J in the semigroup semiring F₀[S] such that J has the largest possible weight.
Subject: directed graphs; Rees matrix semigroups; incidence semigroups; semigroup semirings; data mining applications
Identifier: http://hdl.handle.net/1959.13/1319404
Identifier: uon:23853
Identifier: ISSN:0037-1912
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format